New Algorithms for the Disk Scheduling Problem

Processor speed and memory capacity are increasing several times faster than disk speed. This disparity suggests that disk I/O performance will become an important bottleneck. Methods are needed for using disks more efficiently. Past analysis of disk scheduling algorithms has largely been experimental and little attempt has been made to develop algorithms with provable performance guarantees. We consider the following disk scheduling problem. Given a set of requests on a computer disk and a convex reachability function which determines how fast the disk head travels between tracks, our goal is to schedule the disk head so that it services all the requests in the shortest time possible. We present a 3/2-approximation algorithm (with a constant additive term). For the special case in which the reachability function is linear we present an optimal polynomial-time solution. The disk scheduling problem is related to the special case of the asymmetric Traveling Salesman Problem with the triangle inequality (ATSP) in which all distances are either 0 or some constant . We show how to find the optimal tour in polynomial time and describe how this gives another approximation algorithm for the disk scheduling problem. Finally we consider the on-line version of the problem in which uniformly-distributed requests arrive over time. We present an algorithm (related to the above ATSP) that appears to give higher throughput than previously existing head scheduling algorithms. Supported by NSF contract 9302476-CCR, ARMY grant DAAH04-951-0607 and ARPA contract N00014-95-1-1246. ySupported by NSF contract 9313775-CCR. zSupported by an NSF graduate fellowship, ARMY grant DAAH04-95-10607 and ARPA contract N00014-95-1-1246.